A product expansion in $p$-adic and other non-Archimedean fields
نویسندگان
چکیده
منابع مشابه
Global Newton Iteration over Archimedean and non-Archimedean Fields
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically convergent iterations: the first one involves Newton iteration applied to the approximate roots individually and then interpolation to find the RUR of these approx...
متن کاملQuantifier Elimination in p-adic Fields
We present a tutorial survey of quantifier-elimination and decision procedures in p-adic :fieIds. The p-adic :fieIds are studied in the (so-called) P,,-formalism of Angus Macintyre, for whieh motivation is provided through a rieh body of analogies with real-closed :fields. Quantifier-elimination and decision procedures are described proceeding via a Cylindrical Algebraic Decomposition of affine...
متن کاملFast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common operations in Zpn modulo p . Combining existing methods with recent work of Kedlaya and Umans about modular composition of polynomials, we achieve quasi-linear time algorithms in the parameters n and N , and quasi-linea...
متن کاملOne-dimensional Optimization on Non-archimedean Fields
One dimensional optimization on non-Archimedean fields is presented. We derive first and second order necessary and sufficient optimality conditions. For first order optimization, these conditions are similar to the corresponding real ones; but this is not the case for higher order optimization. This is due to the total disconnectedness of the given non-Archimedean field in the order topology, ...
متن کاملFactoring Polynominals over p-Adic Fields
We give an efficient algorithm for factoring polynomials over finite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1988-0929409-9